Vehicle routing with arrival time diversification
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملSystematic Diversification Metaheuristic for the Vehicle Routing Problem with Time Windows
This paper introduces an extension of the multi-start local search framework [1, 2, 3], named Systematic Diversification for the Vehicle Routing Problem with Time Windows, where the objective is to design least cost routes for a fleet of vehicles from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly ...
متن کاملEmergency Service Vehicle Location Problem with Batch Arrival of Demands
In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...
متن کاملVehicle Routing Problem with Time Windows
The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.11.020